Modern supervised learning neural network models require a large amount of manually labeled data, which makes the construction of domain-specific knowledge graphs time-consuming and labor-intensive. In parallel, although there has been much research on named entity recognition and relation extraction based on distantly supervised learning, constructing a domain-specific knowledge graph from large collections of textual data without manual annotations is still an urgent problem to be solved. In response, we propose an integrated framework for adapting and re-learning knowledge graphs from one coarse domain (biomedical) to a finer-define domain (oncology). In this framework, we apply distant-supervision on cross-domain knowledge graph adaptation. Consequently, no manual data annotation is required to train the model. We introduce a novel iterative training strategy to facilitate the discovery of domain-specific named entities and triples. Experimental results indicate that the proposed framework can perform domain adaptation and construction of knowledge graph efficiently.

我们研究了具有连续状态的可观察到的马尔可夫决策过程（POMDPS）的非政策评估问题（OPE）。由最近提出的近端因果推理框架的动机，我们开发了一个非参数识别结果，以通过时间依赖性代理变量的帮助通过所谓的V-bridge函数来估算策略值。然后，我们开发一种拟合的Q评估类型算法来递归估算V桥功能，其中每个步骤都解决了非参数仪器变量（NPIV）问题。通过分析这个具有挑战性的顺序NPIV问题，我们建立了用于估计V桥功能的有限样本误差界限，并因此根据样本量，地平线和所谓（本地）度量来评估策略值，以评估策略值每个步骤都不适。据我们所知，这是非参数模型下POMDP中OPE绑定的第一个有限样本误差。

数据驱动的个性化决策最近收到了增加的研究兴趣。大多数现有的方法都取决于没有无法衡量的混杂的假设，不幸的是，在实践中，尤其是在观察性研究中无法确保这种混杂。在最近提出的近端因果推理的推动下，我们开发了几种近端学习方法，以估算未衡量的混杂的最佳个性化治疗方案（ITR）。特别是，我们为不同类别的ITR建立了几个识别结果，这表现出了做出不可测试的假设的风险与决策的价值函数改善之间的权衡。基于这些结果，我们提出了几种基于分类的方法来找到各种限制的课堂最佳ITR并发展其理论属性。通过广泛的仿真研究和一项真实的数据应用，我们提出的方法的数值性能具有吸引力。

Inferring missing links or detecting spurious ones based on observed graphs, known as link prediction, is a long-standing challenge in graph data analysis. With the recent advances in deep learning, graph neural networks have been used for link prediction and have achieved state-of-the-art performance. Nevertheless, existing methods developed for this purpose are typically discriminative, computing features of local subgraphs around two neighboring nodes and predicting potential links between them from the perspective of subgraph classification. In this formalism, the selection of enclosing subgraphs and heuristic structural features for subgraph classification significantly affects the performance of the methods. To overcome this limitation, this paper proposes a novel and radically different link prediction algorithm based on the network reconstruction theory, called GraphLP. Instead of sampling positive and negative links and heuristically computing the features of their enclosing subgraphs, GraphLP utilizes the feature learning ability of deep-learning models to automatically extract the structural patterns of graphs for link prediction under the assumption that real-world graphs are not locally isolated. Moreover, GraphLP explores high-order connectivity patterns to utilize the hierarchical organizational structures of graphs for link prediction. Our experimental results on all common benchmark datasets from different applications demonstrate that the proposed method consistently outperforms other state-of-the-art methods. Unlike the discriminative neural network models used for link prediction, GraphLP is generative, which provides a new paradigm for neural-network-based link prediction.

In RGB-D based 6D pose estimation, direct regression approaches can directly predict the 3D rotation and translation from RGB-D data, allowing for quick deployment and efficient inference. However, directly regressing the absolute translation of the pose suffers from diverse object translation distribution between the training and testing datasets, which is usually caused by the diversity of pose distribution of objects in 3D physical space. To this end, we generalize the pin-hole camera projection model to a residual-based projection model and propose the projective residual regression (Res6D) mechanism. Given a reference point for each object in an RGB-D image, Res6D not only reduces the distribution gap and shrinks the regression target to a small range by regressing the residual between the target and the reference point, but also aligns its output residual and its input to follow the projection equation between the 2D plane and 3D space. By plugging Res6D into the latest direct regression methods, we achieve state-of-the-art overall results on datasets including Occlusion LineMOD (ADD(S): 79.7%), LineMOD (ADD(S): 99.5%), and YCB-Video datasets (AUC of ADD(S): 95.4%).

很少有6D姿势估计方法使用骨干网络从RGB和深度图像中提取功能，而Uni6D是这样做的先驱。我们发现UNI6D中性能限制的主要原因是实例外部和实例 - 内噪声。 uni6d不可避免地会由于其固有的直接管道设计而从接收场中的背景像素引入实例外部噪声，并忽略了输入深度数据中的实例 - 内侧噪声。在这项工作中，我们提出了一种两步的denoising方法，以处理UNI6D中上述噪声。在第一步中，实例分割网络用于裁剪和掩盖实例，以消除非实施区域的噪声。在第二步中，提出了一个轻巧的深度剥夺模块，以校准深度特征，然后再将其输入姿势回归网络。广泛的实验表明，我们称为uni6dv2的方法能够有效，稳健地消除噪声，在不牺牲过多的推理效率的情况下超过UNI6D。它还减少了对需要昂贵标签的注释真实数据的需求。

大多数系统都使用不同的模型来用于不同的模式，例如用于处理RGB图像的一种模型和一个用于深度图像的模型。同时，最近的一些作品发现，一个模式的相同模型可以在跨模态转移学习的帮助下用于另一种模式。在本文中，我们进一步发现，通过将视觉变压器与交叉/间模式传输学习一起使用，统一检测器在使用不同的模态作为输入时可以实现更好的性能。统一模型很有用，因为我们不需要维护机器人技术的单独模型或权重，因此它更有效。我们统一的机器人技术系统的一个应用程序场景可以是：如果没有任何模型体系结构和模型权重更新，机器人可以在夜间在白天和深度传感器中使用RGB摄像机或RGB摄像头和深度传感器平稳切换。 Sun RGB-D数据集的实验显示：我们的统一模型不仅有效，而且基于SunRGBD16类别的MAP50具有相似或更好的性能：与RGB进行比较，只有一个，我们的rgb稍差（52.3 $ \ to，to to to $ 51.9）。与点云相比，我们的性能相似（52.7 $ \至$ 52.8）;当使用这项工作中提出的新型模式混合方法时，我们的模型可以通过3.1（52.7 $ \至$ 55.8）的绝对改进获得明显更好的性能，与先前的最佳结果相比。代码（包括培训/推理日志和模型检查点）可用：\ url {https://github.com/liketheflower/yonod.git}

典型的机器学习方法需要集中数据进行模型培训，这可能是由于例如隐私和梯度保护的数据共享的限制。最近提出的联合学习（FL）框架允许在没有集中的数据或数据所有者之间共享数据，允许在没有数据共享的数据中学习共享模型。然而，我们在本文中展示了联合模型的泛化能力在非独立和非相同分布（非IID）数据上差，特别是当由于重量分歧现象而使用联邦平均（FEDAVG）策略时。我们提出了一种新颖的促进算法，用于解决这种概括问题，以及在基于梯度的优化中实现了更快的收敛速率。此外，还引入了使用同型加密（HE）和差异隐私（DP）的安全渐变共享协议来防御梯度泄漏攻击。我们展示了所提出的联邦升压（FedBoost）方法在使用公共基准测试中对文本识别任务的预测准确性和运行时间效率实现了显着提高。

Nonlinear mapping is an essential and common demand in online systems, such as sensor systems and mobile phones. Accelerating nonlinear mapping will directly speed up online systems. Previously the authors of this paper proposed a Dendrite Net (DD) with enormously lower time complexity than the existing nonlinear mapping algorithms; however, there still are redundant calculations in DD. This paper presents a DD with an acceleration module (AC) to accelerate nonlinear mapping further. We conduct three experiments to verify whether DD with AC has lower time complexity while retaining DD's nonlinear mapping properties and system identification properties: The first experiment is the precision and identification of unary nonlinear mapping, reflecting the calculation performance using DD with AC for basic functions in online systems. The second experiment is the mapping precision and identification of the multi-input nonlinear system, reflecting the performance for designing online systems via DD with AC. Finally, this paper compares the time complexity of DD and DD with AC and analyzes the theoretical reasons through repeated experiments. Results: DD with AC retains DD's excellent mapping and identification properties and has lower time complexity. Significance: DD with AC can be used for most engineering systems, such as sensor systems, and will speed up computation in these online systems. The code of DD with AC is available on https://github.com/liugang1234567/Gang-neuron

Masked image modeling (MIM) performs strongly in pre-training large vision Transformers (ViTs). However, small models that are critical for real-world applications cannot or only marginally benefit from this pre-training approach. In this paper, we explore distillation techniques to transfer the success of large MIM-based pre-trained models to smaller ones. We systematically study different options in the distillation framework, including distilling targets, losses, input, network regularization, sequential distillation, etc, revealing that: 1) Distilling token relations is more effective than CLS token- and feature-based distillation; 2) An intermediate layer of the teacher network as target perform better than that using the last layer when the depth of the student mismatches that of the teacher; 3) Weak regularization is preferred; etc. With these findings, we achieve significant fine-tuning accuracy improvements over the scratch MIM pre-training on ImageNet-1K classification, using all the ViT-Tiny, ViT-Small, and ViT-base models, with +4.2%/+2.4%/+1.4% gains, respectively. Our TinyMIM model of base size achieves 52.2 mIoU in AE20K semantic segmentation, which is +4.1 higher than the MAE baseline. Our TinyMIM model of tiny size achieves 79.6% top-1 accuracy on ImageNet-1K image classification, which sets a new record for small vision models of the same size and computation budget. This strong performance suggests an alternative way for developing small vision Transformer models, that is, by exploring better training methods rather than introducing inductive biases into architectures as in most previous works. Code is available at https://github.com/OliverRensu/TinyMIM.